Hilbertian Convex Feasibility Problem: Convergence of Projection Methods∗

The classical problem of finding a point in the intersection of countably many closed and convex sets in a Hilbert space is considered. Extrapolated iterations of convex combinations of approximate projections onto subfamilies of sets are investigated to solve this problem. General hypotheses are made on the regularity of the sets and various strategies are considered to control the order in which the sets are selected. Weak and strong convergence results are established within this broad framework, which provides a unified view of projection methods for solving hilbertian convex feasibility problems.